Shape Computation Algorithm for Closed Elastica
نویسندگان
چکیده
منابع مشابه
An Algorithm for the Computation of Polyhedral Invariant Sets for Closed-Loop Linear MPC Systems
Given an asymptotically stabilizing linear MPC controller, this paper proposes an algorithm to construct invariant polyhedral sets for the closed-loop system. The approach exploits a recently developed DC (Difference of Convex functions) programming technique developed by the authors to construct a polyhedral set in between two convex sets. Here, the inner convex set is any given level set V (x...
متن کاملLocal Computation of Shape
Local, parallel analysis of shading in an image may be used to infer surface shape without o priori knowledge about the viewed scene. The following has been proven: Given a reasonable assumption about surface smoothness, local analysis of the second derivative of image intensity allows the image-plane component of surface orientation to be determined exactly, and a maximum-likelihood estimate o...
متن کاملDetection of Closed Shape Objects
A real-time system that detects objects in digital images is presented in this paper. An Object is considered as a closed shape figure. The detection algorithm aims at finding the closed shape objects and eliminating the background regions. The detection starts by implementing the hit-miss transform (HMT) to detect edges and remove noise. Watershed transform (WST) is applied to analyse the bina...
متن کاملThe selective affinity of anionic detergents for elastica: a new stain for elastica.
This report concerns the observation that certain anionic detergents have a specific affinity for elastica, and because these anionic detergents precipitate cationic basic dyes in aqueous solution, a rather specific stain for elastica can be obtained. There are many satisfactory methods for the histologic demonstration of elastica, the most popular being: a) acid orcein (Unna), b) Verhoef's, c)...
متن کاملAlgorithm Engineering for Parallel Computation
The emerging discipline of algorithm engineering has primarily focussed on transforming pencil-and-paper sequential algorithms into robust, efficient, well tested, and easily used implementations. As parallel computing becomes ubiquitous, we need to extend algorithm engineering techniques to parallel computation. Such an extension adds significant complications. After a short review of algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Robotics Society of Japan
سال: 2014
ISSN: 0289-1824,1884-7145
DOI: 10.7210/jrsj.32.365